A note on distance approximating trees in graphs
نویسندگان
چکیده
منابع مشابه
A note on distance approximating trees in graphs
Let G = (V, E) be a connected graph endowed with the standard graph-metric dG and in which longest induced simple cycle has length λ(G). We prove that there exists a tree T = (V, F) such that |dG (u, v) − dT (u, v)| ≤ ⌊λ(G) 2 ⌋ + α for all vertices u, v ∈ V, where α = 1 if λ(G) = 4, 5 and α = 2 otherwise. The case λ(G) = 3 (i.e., G is a chordal graph) has been considered in Brandstädt, Chepoi, ...
متن کاملDistance Approximating Trees for Chordal and Dually Chordal Graphs
In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a dually chordal graph, then there exists a spanning tree T of G that is an additive 3-spanner as wel...
متن کاملnote on edge distance-balanced graphs
edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.
متن کاملA note on approximating Max-Bisection on regular graphs
We design a 0.795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio of 0.834. 2001 Elsevier Science B.V. All rights reserved.
متن کاملA note on approximating snowflake metrics by trees
prove that the tree construction of Fakcharoenphol, Rao, and Talwar [2] can be used to approximate snowflake metrics by trees with expected distortion bounded independently of the size of the metric space. The constant of distortion we derive depends linearly on the dimension of the metric space. We also present an algorithm for building a single tree whose cost is linear in the problem size. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2000
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)00731-6